2 Edmonds ’ Algorithm for Maximum Matching 3 Minimum Edge Covers
نویسنده
چکیده
Any set of vertices V ′ with {{u, v} : u ∈ V ′} (smallest or otherwise) is called a vertex cover of the graph. Intuitively, a cover is a dusting of vertices so that every edge in the graph is “covered” by some vertex, although you might also say that each edge is “hit” by some vertex. Note that vertex cover is a minimization problem, with the goal to find a vertex cover that is as small as possible. On the other hand, finding a large matching in a graph is a maximization problem:
منابع مشابه
Lecture notes for “Analysis of Algorithms”: Maximum matching in general graphs
We present Edmonds’ blossom shrinking algorithm for finding a maximum cardinality matching in a general graph. En route, we obtain an efficient algorithm for finding a minimum vertex cover in a bipartite graph and show that its size is equal to the size of the maximum matching in the graph. We also show that the size of a maximum matching in a general graph is equal to the size of a minimum odd...
متن کاملPacking Dicycle Covers in Planar Graphs with No K5-e Minor
We prove that the minimum weight of a dicycle is equal to the maximum number of disjoint dicycle covers, for every weighted digraph whose underlying graph is planar and does not have K5 − e as a minor (K5 − e is the complete graph on five vertices, minus one edge). Equality was previously known when forbidding K4 as a minor, while an infinite number of weighted digraphs show that planarity does...
متن کاملMinimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the sum of the n distances between matched pairs is minimized. The graph theoretic version of this problem has been extensively studied since the pioneering work of Edmonds. The best time bound known for MEWM is O(n 2:5 (...
متن کاملAlgorithms and complexity results for finding graphs with extremal Randić index
We show that finding a subgraph realization with the minimum generalized Randić index for a given base graph and degree sequence is solvable in polynomial time by formulating the problem as the minimum weight perfect b-matching problem of Edmonds (J Res Natl Bur Stand 69B (1965), 125–130). However, the realization found via this reduction is not guaranteed to be connected. Approximating the min...
متن کاملPacking of induced stars in a graphbyAlexander
We consider simple undirected graphs. An edge subset A of G is called an induced n{star packing of G if every component of the subgraph G[A] induced by A is a star with at most n edges and is an induced subgraph of G. We consider the problem of nding an induced n{star packing of G that covers the maximum number of vertices. This problem is a natural generalization of the classical matching prob...
متن کامل